A conjecture on product decompositions in simple groups
نویسندگان
چکیده
منابع مشابه
On the product decomposition conjecture for finite simple groups
We prove that if G is a finite simple group of Lie type and S a subset of G of size at least two then G is a product of at most c log |G|/ log |S| conjugates of S, where c depends only on the Lie rank of G. This confirms a conjecture of Liebeck, Nikolov and Shalev in the case of families of simple groups of bounded rank. We also obtain various related results about products of conjugates of a s...
متن کاملProduct decompositions of quasirandom groups and a Jordan type theorem
We first note that a result of Gowers on product-free sets in groups has an unexpected consequence: If k is the minimal degree of a representation of the finite group G, then for every subset B of G with |B| > |G|/k 1 3 we have B = G. We use this to obtain improved versions of recent deep theorems of Helfgott and of Shalev concerning product decompositions of finite simple groups, with much sim...
متن کاملA conjecture on B-groups
In this note, I propose the following conjecture : a finite group G is nilpotent if and only if its largest quotient B-group β(G) is nilpotent. I give a proof of this conjecture under the additional assumption that G be solvable. I also show that this conjecture is equivalent to the following : the kernel of restrictions to nilpotent subgroups is a biset-subfunctor of the Burnside functor. AMS ...
متن کاملBase sizes for simple groups and a conjecture of Cameron
Let G be a permutation group on a finite set Ω. A base for G is a subset B ⊆ Ω with pointwise stabilizer in G that is trivial; we write b(G) for the smallest size of a base for G. In this paper we prove that b(G) ! 6 if G is an almost simple group of exceptional Lie type and Ω is a primitive faithful G-set. An important consequence of this result, when combined with other recent work, is that b...
متن کاملPath decompositions and Gallai's conjecture
LetG be a connected simple graph on n vertices. Gallai’s conjecture asserts that the edges ofG can be decomposed into n2 paths. Let H be the subgraph induced by the vertices of even degree in G. Lovász showed that the conjecture is true ifH contains at most one vertex. Extending Lovász’s result, Pyber proved that the conjecture is true if H is a forest. A forest can be regarded as a graph in wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2010
ISSN: 1661-7207
DOI: 10.4171/ggd/107